Array organization and architecture to perform range-match operations with content addressable memory (cam) circuits

ABSTRACT

An array organization and architecture for a content addressable memory (CAM) system. More specifically, a circuit is provided for that includes a first portion of the CAM configured to perform a first inequality operation implemented between 1 to n CAM entries. The circuit further includes a second portion of the CAM configured to perform a second inequality operation implemented between the 1 to n CAM entries. The first portion and the second portion are triangularly arranged side by side such that the first inequality operation and the second inequality operation are implemented between the 1 to n CAM entries using the same n wordlines.

FIELD OF THE INVENTION

The invention relates generally to computer memory systems, and more particularly, relates to an array organization and architecture for a content addressable memory (CAM) system.

BACKGROUND

CAM is a hardware module that either acts as a separate integrated circuit module or is embedded in another integrated circuit such as computer processing unit (CPU). More specifically, CAM is an application specific memory that allows its entire contents to be typically searched within a single clock cycle. CAM typically compares input search data against a table of stored data, and returns the address of the matching data. CAMs having a single clock cycle throughput make them faster than other hardware and software based search systems. Therefore, CAMs can be used in a wide variety of applications requiring high search speeds (e.g., image coding, parametric curve extraction, and Lempel-Ziv compression). The primary commercial application of CAMs today is to classify and forward Internet protocol (IP) packets in network routers.

There are two basic forms of CAM, the binary CAM (BCAM) and ternary CAM (TCAM). Binary CAMs support storage and searching of binary bits, and perform exact-match searches by storing either logic bit “0” or logic bit “1”. TCAMs support storing of logic bit “0”, logic bit “1”, or a don't care logic bit “X”. The don't care logic bit acts as a wildcard during searches, and allow TCAM to be attractive for implementing pattern-matching algorithms such as routing table rules (e.g., longest-prefix-match and range-match searches).

SUMMARY

In a first aspect of the invention, a circuit is provided for that includes a first portion of the CAM configured to perform a first inequality operation implemented between 1 to n CAM entries. The circuit further includes a second portion of the CAM configured to perform a second inequality operation implemented between the 1 to n CAM entries. The first portion and the second portion are triangularly arranged side by side such that the first inequality operation and the second inequality operation are implemented between the 1 to n CAM entries using the same n wordlines.

In another aspect of the invention, a circuit is provided for that includes a first portion of a CAM configured to perform a first inequality operation implemented between 1 to n CAM entries. The 1 to n CAM entries of the first portion are read from left to right. The circuit further includes a second portion of the CAM configured to perform a second inequality operation implemented between the 1 to n CAM entries. The 1 to n CAM entries of the second portion are read from right to left, and the second portion is flipped 180° and triangularly arranged side by side the first portion.

In yet another aspect of the invention, a method is provided for that includes performing a first inequality operation implemented between 1 to n CAM entries using a first portion of a CAM. The method further including performing a second inequality operation implemented between the 1 to n CAM entries using a second portion of the CAM. The first inequality operation and the second inequality operation are performed between the 1 to n CAM entries using the same n wordlines.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The present invention is described in the detailed description, which follows, in reference to the noted plurality of drawings by way of non-limiting examples of exemplary embodiments of the present invention.

FIGS. 1 a and 1 b show a generic use of a TCAM to implement range-matching in accordance with aspects of the invention;

FIG. 2 shows a specific use of a CAM to implement range-matching in accordance with aspects of the invention;

FIG. 3 shows the addition of valid bits to a CAM and a schematic diagram of a latch circuit in accordance with aspects of the invention;

FIG. 4 shows an example application of a CAM to implement range-matching in accordance with aspects of the invention;

FIGS. 5 and 6 show TCAM and CAM layout diagrams on semiconductor in accordance with aspects of the invention; and

FIG. 7 is a flow diagram of a design process used in semiconductor design, manufacture, and/or test.

DETAILED DESCRIPTION

The invention relates generally to computer memory systems, and more particularly, relates to an array organization and architecture for a content addressable memory (CAM) system. Generally, ternary CAMs (TCAMs) are used for range matching (e.g., combined inequality functions) and the degenerative operations less-than and greater-than provide for a wide-spread application space. However, when a TCAM is used to implement a range-match function, a lot of cells are wasted in an “always match” state. In embodiments, the present invention excludes these wasted cells from the TCAM by rearranging or reorganizing the traditional TCAM structure to a binary CAM (BCAM) structure. Advantageously, the exclusion of the wasted cells saves the area (i.e., shrinks the footprint that the TCAM takes up on a semiconductor product) and the power otherwise consumed by the TCAM matching the wasted cells.

FIG. 1 a shows a generic use of a TCAM 5 to implement range-matching. The cells of TCAM 5 are arranged into horizontal words (e.g., FIG. 1 a shows cell groups 10 and 15 that have 6 word lines and each word line comprises 6 address bits or individual cells). Each cell contains both storage and comparison circuitry for implementing an operation. The cell groups 10 and 15 of color-coded entries indicate a single operation or function, e.g., less-than or greater-than. The output of two groups may be ANDed together to produce a range-match function (e.g., less-than the range max AND greater-than the range min). The cells labeled m are matching either a logic bit “0” or a logic bit “1”; the triangles 20 on the right of each group comprise “always match” cells labeled “*” and are matching a wildcard of don't care logic bits “X” (i.e., always matching because logic bit “X” essential represents logic bit “0” or logic bit “1”), which are generally wasted cells that are implemented for flexibility in traditional TCAM. A less-than or greater-than operation can be implemented in between 1 to n TCAM entries, where n is the address width, so on average n/2 TCAM entries may be used per operation. In contrast, embodiments of the present invention may use n entries per operation. Therefore, in accordance with aspects of the present invention, having F n-entry groups allows for F operations that can be performed. Having F n/2-entry groups in a traditional TCAM does not allow for F operations that can be performed.

In embodiments, this waste may be observed to create triangular patterns in the TCAM layout, see e.g., the triangular pattern of “*” in FIG. 1 a. These triangular patterns of waste may be eliminated by taking the match cells m from the even groupings 25, rotating them 180°, and placing them where the “always match” cells “*” used to be in the odd groupings 30. This is shown in FIG. 1 a, with the group color-coding maintained to show how the new layout is achieved. Note that one column 35 (as shown in FIGS. 1 a and 1 b) may be added in embodiments of the present invention to accommodate this layout, but this is insignificant for any decent-sized memory array. Alternatively, one row 38 (as shown in FIG. 1 b) may be added per pair of entries to accommodate the new layout. Importantly, eliminating the don't care cells “*” means this memory array can now be built from BCAM cells instead of traditional TCAM cells (i.e., the use of don't care logic bits “X” is no longer required). Therefore, advantageously, embodiments of the present invention save about 2× area in cell size and about 2× area in operations/entry but require 2× the entries for a total savings of about 50% area for similar functionality.

FIG. 2 shows a specific use of a TCAM to implement range-matching (e.g., combined inequality functions) in accordance with aspects of the present invention. The TCAM shown in FIG. 2 comprises a 6-bit address space and group 40 may be configured to detect all numbers less than 63 (e.g., worst-case less than is <2⁶−1), group 45 may be configured to detect numbers greater than 0 (e.g., worst-case greater than is >0), and group 50 may be configured to detect numbers in the range of 1:62 (e.g., worst-case range is [1:2⁶−2]). However, one of ordinary skill in the art should understand that the embodiments of the present invention may be implement using any type of address space and is not limit to a 6-bit address space, e.g., a n-bit address space may have inequality functions such that the worst-case less than is <2^(n)−1; the worst-case greater than is >0; and the worst-case range is [1:2^(n)−2].

As shown in FIG. 2, group 40 illustrates the inequality function worst-case less than is <63, which may be used to search/detect all numbers less than 63. The first 6-bit address space (0*****) of group 40 may be configured to detect all numbers from 0-31 (32 numbers), the second 6-bit address space (10****) of group 40 may be configured to detect all numbers from 32-47 (16 numbers), the third 6-bit address space (110***) of group 40 may be configured to detect all numbers from 48-55 (8 numbers), the fourth 6-bit address space (1110**) of group 40 may be configured to detect all numbers from 56-59 (4 numbers), the fifth 6-bit address space (11110*) of group 40 may be configured to detect all numbers from 60-61 (2 numbers), and the sixth 6-bit address space (111110) of group 40 may be configured to detect the final number 62 (1 number). Similar function configurations for searching/detecting numbers are illustrated in groups 45 and 50 (e.g., worst-case less than is 2⁶−1 and worst-case range is [1:2⁶−2] respectively), and should be understood by those of ordinary skill in the art.

Implementing these operations in a TCAM structure creates triangle patterns that arise from the binary nature of performing the inequality functions, as discussed herein. These triangular patterns of waste may be eliminated by taking the match cells comprising the “0” and “1” logic bits from the even groupings, rotating them 180°, and placing them where the “always match” cells “*” used to be in the odd groupings. This is shown in FIG. 2, with the group color-coding maintained to show how the new layout is achieved, which may be implemented on a semiconductor chip to achieve a reduction in area taken by the memory array. Note that one column 55 may be added in embodiments of the present invention to accommodate this layout (e.g., expanding to a 7-bit memory array (n+1) from an original 6-bit memory array (n)), but this is insignificant for any decent-sized memory array. Eliminating the don't care cells “*” means this memory array can now be built from BCAM cells instead of TCAM cells (i.e., the use of don't care logic bits “X” is no longer required and wasted).

By switching to BCAM, embodiments of the present invention lose a never-match state that is traditionally provided for by TCAM. Because of this, embodiments of the present invention may require a valid bit for each CAM entry. This could be implemented as two extra bits 59 in each CAM word (i.e., one for the left matchline and one for the right matchline) as shown in FIG. 3 left. However, in alternative embodiments, the valid bit may be latched and used to gate the matchline precharge, which may provide a more power-efficient CAM system. This is shown in FIG. 3 right. A valid bit is stored in latch 60 and used to mask the CAM precharge command for that CAM word via the AND gate 61. This prevents the precharge driver 62 from precharing the matchline if a valid pattern is not stored in the associated CAM entry. As should be understood by those of ordinary skill in the art, the contents of this latch 60 would ideally be programmed at the same time as the memory array contents.

FIG. 4 shows an example application of embodiments of the present invention. For example, an operation configured to determine a match between twenty numbers may be mapped such that any number <2 is offset by 0 such that 0 maps to 0 and 1 maps to 1, any number <5 is offset by 2 such that 2 maps to 4, 3 maps to 5, and 4 maps to 6, any number <6 is offset by 3 such that 5 maps to 8, etc. Accordingly, implementing this operation on a silicon layout in accordance with aspects of the present invention, leads to a memory array 65 in which any number <2 is determined by the lighter triangle of the first group 70 matching “0000*”. Any number <5 is determined by the lighter triangle of the second group 75 matching “000**” or “0010*”. Any number <6 is determined by the lighter triangle of the third group 80 matching “000**” or “0010*”. Any number <9 is determined by the lighter triangle of the fourth group 85 matching “00***” or “01000”. Any number <15 is determined by the darker triangle of the fourth group 85 matching “00***”, “010**”, “0110*”, or “01110”. Any number <18 is determined by the darker triangle of the third group 80 matching “0****” or “1000*”. Any number <21 is determined by the darker triangle of the second 75 group matching “100**” or “10100”. The darker triangle of the first group 70 is not utilized. As should be understood, the lighter triangles are read left to right and the darker triangles are read right to left. As should also be understood, the “*” characters in the above description are implicit within the memory array 65 and do not occupy actual storage cells.

In embodiments, the memory array design discussed herein may have implications for the array structure and wiring formed on the silicon. For example, as shown in FIG. 5 left, a traditional TCAM cell 90 may comprise 16 transistors 95 (e.g., storage and comparison circuitry). Left and right bitlines 100 and word line 105 may be used to program the TCAM cell 90. Search lines 110 run vertically though the TCAM cell 90 and broadcast the search data to the TCAM cell 90. Matchline 115 runs horizontally though the TCAM cell 90 and indicates whether the search data matches the cell's logic bit, e.g., “0”, “1”, “X”. An activated matchline indicates a match and a deactivated matchline indicates a non-match or a mismatch. The matchline 115 may be configured as an input to an encoder (not shown) that generates an address corresponding to the match location.

In embodiments, as shown in FIG. 5 right, a BCAM cell 120 may comprise 10 transistors 125 (e.g., BCAM cells require less storage and comparison circuitry than TCAM cells). Left and right bitlines 130 and word line 135 may be used to program the BCAM cell 120. Search lines 140 and passing search lines 145 run vertically though the BCAM cell 120 and broadcast the search data to the BCAM cell 120. Matchline 150 runs horizontally though the BCAM cell 120 and indicates whether the search data matches the cell's logic bit, e.g., “0”, “1”. An activated matchline indicates a match and a deactivated matchline indicates a non-match or a mismatch. The matchline 150 may be configured as an input to an encoder (not shown) that generates an address corresponding to the match location.

As shown in FIG. 5, two pairs of searchlines (i.e., search lines 140 and passing search lines 145) may be required per column of cells in embodiments comprising the BCAM cell 120 instead of one pair of search lines (i.e., search lines 110) per column of cells as in the traditional TCAM cell 90. However, the reduction in transistors from 16 in the traditional TCAM cell to 10 in embodiments comprising the BCAM cell 120 advantageously provide less complex circuitry and a reduced silicon footprint (i.e., less area is taken up by the BCAM cells because of the reduction in the number of transistors). As should be understood by those of ordinary skill in the art, the TCAM cell 90 and BCAM cell 120 may be implemented using other components than transistors, e.g., latches, while still falling within the spirit and scope of the invention and achieving a reduction in silicon area.

As shown in FIG. 6 top, a traditional TCAM 200 configured using multiple TCAM cells 90, as shown in FIG. 5, may comprise left and right bitlines 100, word lines 105, search lines 110, and matchlines 115. As shown in FIG. 6 bottom, a CAM 210 implemented in accordance with aspects of the present invention may be configured using multiple BCAM cells 120, as shown in FIG. 5, and may comprise left and right bitlines 130, word lines 135, search lines 140, passing search lines 145, and left and right matchlines 150. Accordingly, as should be understood by those of ordinary skill in the art, the CAM implementation in accordance with aspects of the present invention requires right and left matchlines 150 (i.e., a set of matchlines for the lighter triangle and a set of match lines for the darker triangle) and two sets of search lines (i.e., a set of search lines for the lighter triangle and a set of passing search lines for the darker triangle). However, no extra tracks are required for the CAM implementation. Instead, the track density simply doubles because the BCAM cells are half the size of the TCAM cells.

More specifically, implications of embodiments of the present invention comprising a reorganized CAM include twice as many matchlines as those of the traditional TCAM but a same number of matchline tracks since the matchlines exit on both sides of the array. Additionally, the reorganized CAM includes twice the number of search lines (e.g., one set left to right for the lighter triangle and one set right to left for the darker triangle) but a same number of tracks since the bitlines are reduced to a single set. Alternatively, a double-pump CAM may be used and only half the matchlines may be precharged. Additionally, a worst case number of CAM entries for the reorganized CAM requires n entries for n-bit addresses as compared to n/2 in an average case for a traditional TCAM. Additionally, one column or row is required to be added to accommodate the reorganized layout but this is insignificant for any decent-sized memory array. Additionally, traditional TCAM cells comprising a large number of circuitry component (e.g., transistors) is cut approximately in half using reorganized CAM cells that essentially function as BCAM cells. Consequently, embodiments of the present invention advantageously save about 2× area in cell size and about 2× area in operations/entry but require 2× the entries for a total savings of about 50% area for similar functionality.

FIG. 7 is a flow diagram of a design process used in semiconductor design, manufacture, and/or test. FIG. 7 shows a block diagram of an exemplary design flow 900 used for example, in semiconductor IC logic design, simulation, test, layout, and manufacture. Design flow 900 includes processes, machines and/or mechanisms for processing design structures or devices to generate logically or otherwise functionally equivalent representations of the design structures and/or devices described above and shown in FIGS. 1 a, 1 b, and 2-6. The design structures processed and/or generated by design flow 900 may be encoded on machine-readable transmission or storage media to include data and/or instructions that when executed or otherwise processed on a data processing system generate a logically, structurally, mechanically, or otherwise functionally equivalent representation of hardware components, circuits, devices, or systems. Machines include, but are not limited to, any machine used in an IC design process, such as designing, manufacturing, or simulating a circuit, component, device, or system. For example, machines may include: lithography machines, machines and/or equipment for generating masks (e.g. e-beam writers), computers or equipment for simulating design structures, any apparatus used in the manufacturing or test process, or any machines for programming functionally equivalent representations of the design structures in any medium (e.g. a machine for programming a programmable gate array).

Design flow 900 may vary depending on the type of representation being designed. For example, a design flow 900 for building an application specific IC (ASIC) may differ from a design flow 900 for designing a standard component or from a design flow 900 for instantiating the design into a programmable array, for example a programmable gate array (PGA) or a field programmable gate array (FPGA) offered by Altera® Inc. or Xilinx® Inc.

FIG. 7 illustrates multiple such design structures including an input design structure 920 that is preferably processed by a design process 910. Design structure 920 may be a logical simulation design structure generated and processed by design process 910 to produce a logically equivalent functional representation of a hardware device. Design structure 920 may also or alternatively comprise data and/or program instructions that when processed by design process 910, generate a functional representation of the physical structure of a hardware device. Whether representing functional and/or structural design features, design structure 920 may be generated using electronic computer-aided design (ECAD) such as implemented by a core developer/designer. When encoded on a machine-readable data transmission, gate array, or storage medium, design structure 920 may be accessed and processed by one or more hardware and/or software modules within design process 910 to simulate or otherwise functionally represent an electronic component, circuit, electronic or logic module, apparatus, device, or system such as those shown in FIGS. 1 a, 1 b, and 2-6. As such, design structure 920 may comprise files or other data structures including human and/or machine-readable source code, compiled structures, and computer-executable code structures that when processed by a design or simulation data processing system, functionally simulate or otherwise represent circuits or other levels of hardware logic design. Such data structures may include hardware-description language (HDL) design entities or other data structures conforming to and/or compatible with lower-level HDL design languages such as Verilog and VHDL, and/or higher level design languages such as C or C++.

Design process 910 preferably employs and incorporates hardware and/or software modules for synthesizing, translating, or otherwise processing a design/simulation functional equivalent of the components, circuits, devices, or logic structures shown in FIGS. 1 a, 1 b, and 2-6 to generate a netlist 980 which may contain design structures such as design structure 920. Netlist 980 may comprise, for example, compiled or otherwise processed data structures representing a list of wires, discrete components, logic gates, control circuits, I/O devices, models, etc. that describes the connections to other elements and circuits in an integrated circuit design. Netlist 980 may be synthesized using an iterative process in which netlist 980 is resynthesized one or more times depending on design specifications and parameters for the device. As with other design structure types described herein, netlist 980 may be recorded on a machine-readable data storage medium or programmed into a programmable gate array. The medium may be a non-volatile storage medium such as a magnetic or optical disk drive, a programmable gate array, a compact flash, or other flash memory. Additionally, or in the alternative, the medium may be a system or cache memory, buffer space, or electrically or optically conductive devices and materials on which data packets may be transmitted and intermediately stored via the Internet, or other networking suitable means.

Design process 910 may include hardware and software modules for processing a variety of input data structure types including netlist 980. Such data structure types may reside, for example, within library elements 930 and include a set of commonly used elements, circuits, and devices, including models, layouts, and symbolic representations, for a given manufacturing technology (e.g., different technology nodes, 32 nm, 45 nm, 90 nm, etc.). The data structure types may further include design specifications 940, characterization data 950, verification data 960, design rules 970, and test data files 985 which may include input test patterns, output test results, and other testing information. Design process 910 may further include, for example, standard mechanical design processes such as stress analysis, thermal analysis, mechanical event simulation, process simulation for operations such as casting, molding, and die press forming, etc. One of ordinary skill in the art of mechanical design can appreciate the extent of possible mechanical design tools and applications used in design process 910 without deviating from the scope and spirit of the invention. Design process 910 may also include modules for performing standard circuit design processes such as timing analysis, verification, design rule checking, place and route operations, etc.

Design process 910 employs and incorporates logic and physical design tools such as HDL compilers and simulation model build tools to process design structure 920 together with some or all of the depicted supporting data structures along with any additional mechanical design or data (if applicable), to generate a second design structure 990.

Design structure 990 resides on a storage medium or programmable gate array in a data format used for the exchange of data of mechanical devices and structures (e.g. information stored in a IGES, DXF, Parasolid XT, JT, DRG, or any other suitable format for storing or rendering such mechanical design structures). Similar to design structure 920, design structure 990 preferably comprises one or more files, data structures, or other computer-encoded data or instructions that reside on transmission or data storage media and that when processed by an ECAD system generate a logically or otherwise functionally equivalent form of one or more of the embodiments of the invention shown in FIGS. 1 a, 1 b, and 2-6. In one embodiment, design structure 990 may comprise a compiled, executable HDL simulation model that functionally simulates the devices shown in FIGS. 1 a, 1 b, and 2-6.

Design structure 990 may also employ a data format used for the exchange of layout data of integrated circuits and/or symbolic data format (e.g. information stored in a GDSII (GDS2), GL1, OASIS, map files, or any other suitable format for storing such design data structures). Design structure 990 may comprise information such as, for example, symbolic data, map files, test data files, design content files, manufacturing data, layout parameters, wires, levels of metal, vias, shapes, data for routing through the manufacturing line, and any other data required by a manufacturer or other designer/developer to produce a device or structure as described above and shown in FIGS. 1 a, 1 b, and 2-6. Design structure 990 may then proceed to a stage 995 where, for example, design structure 990: proceeds to tape-out, is released to manufacturing, is released to a mask house, is sent to another design house, is sent back to the customer, etc.

The methods as described above are used in the fabrication of integrated circuit chips. The resulting integrated circuit chips can be distributed by the fabricator in raw wafer form (that is, as a single wafer that has multiple unpackaged chips), as a bare die, or in a packaged form. In the latter case the chip is mounted in a single chip package (such as a plastic carrier, with leads that are affixed to a motherboard or other higher level carrier) or in a multichip package (such as a ceramic carrier that has either or both surface interconnections or buried interconnections). In any case the chip is then integrated with other chips, discrete circuit elements, and/or other signal processing devices as part of either (a) an intermediate product, such as a motherboard, or (b) an end product. The end product can be any product that includes integrated circuit chips, ranging from toys and other low-end applications to advanced computer products having a display, a keyboard or other input device, and a central processor.

The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. 

What is claimed is:
 1. A circuit comprising: a first portion of a content addressable memory (CAM) configured to perform a first inequality operation implemented between 1 to n CAM entries; and a second portion of the CAM configured to perform a second inequality operation implemented between the 1 to n CAM entries, wherein the first portion and the second portion are triangularly arranged side by side such that the first inequality operation and the second inequality operation are implemented between the 1 to n CAM entries using the same n wordlines.
 2. The circuit of claim 1, wherein the CAM is n+1 bits wide or the CAM includes an additional row per pair of the first inequality operation and the second inequality operation.
 3. The circuit of claim 1, further comprising a first set of search lines configured to broadcast search data to the first portion and a second set of search lines configured to broadcast the search data to the second portion, wherein at least one cell of the CAM comprises both the first set of search lines and the second set of search lines running through the at least one cell.
 4. The circuit of claim 3, further comprising: a wire track running through each of the 1 to n CAM entries implemented in the first portion and the second portion; a first matchline in each wire track and configured to indicate a match or mismatch for each of the 1 to n CAM entries implemented in the first portion; and a second matchline in each wire track configured to indicate a match or mismatch for each of the 1 to n CAM entries implemented in the second portion.
 5. The circuit of claim 1, wherein the first inequality operation is a less-than or greater-than operation, and the second inequality operation is a less-than or greater-than operation.
 6. The circuit of claim 5, wherein a first output of the first portion and a second output of the second portion are ANDed together to produce a range-match function.
 7. A circuit comprising: a first portion of a content addressable memory (CAM) configured to perform a first inequality operation implemented between 1 to n CAM entries, wherein the 1 to n CAM entries are read from left to right; and a second portion of the CAM configured to perform a second inequality operation implemented between the 1 to n CAM entries, wherein the 1 to n CAM entries are read from right to left, wherein the second portion is flipped 180° and triangularly arranged side by side the first portion.
 8. The circuit of claim 7, wherein the CAM is n+1 bits wide or the CAM includes an additional row per pair of the first inequality operation and the second inequality operation.
 9. The circuit of claim 7, wherein the first inequality operation and the second inequality operation are implemented between the 1 to n CAM entries using the same n wordlines.
 10. The circuit of claim 7, further comprising: a first matchline configured to indicate a match or mismatch for each of the 1 to n CAM entries implemented in the first portion; and a second matchline configured to indicate a match or mismatch for each of the 1 to n CAM entries implemented in the second portion.
 11. The circuit of claim 10, wherein the first matchline and the second matchline are located in a same wire track.
 12. The circuit of claim 7, further comprising a first set of search lines configured to broadcast search data to the first portion and a second set of search lines configured to broadcast the search data to the second portion.
 13. The circuit of claim 12, wherein at least one cell of the CAM comprises both the first set of search lines and the second set of search lines running through the at least one cell.
 14. The circuit of claim 12, wherein at least one column of the CAM comprises both the first set of search lines and the second set of search lines running through the at least one column.
 15. The circuit of claim 12, wherein: at least one column of the CAM comprises both the first set of search lines and the second set of search lines running through the at least one column; a left most column of the CAM comprises only the first set of search lines; and a right most column of the CAM comprises only the second set of search lines.
 16. A method comprising: performing a first inequality operation implemented between 1 to n content addressable memory (CAM) entries using a first portion of a CAM; and performing a second inequality operation implemented between the 1 to n CAM entries using a second portion of the CAM, wherein the first inequality operation and the second inequality operation are performed between the 1 to n CAM entries using the same n wordlines.
 17. The method of claim 16, wherein: the performing the first inequality operation comprises reading the 1 to n CAM entries from left to right; and the performing the second inequality operation comprises reading the 1 to n CAM entries from right to left.
 18. The method of claim 16, further comprising: broadcasting search data to the first portion using a first set of search lines; and broadcasting the search data to the second portion using a second set of search lines.
 19. The method of claim 16, wherein the first inequality operation is a less-than or greater-than operation, and the second inequality operation is a less-than or greater-than operation.
 20. The method of claim 19, wherein: the performing the first inequality operation comprises obtaining a first output; and the performing the second inequality operation comprises obtaining a second output; and the first output and the second output are ANDed together to produce a range-match function. 